D-Rank: A Framework for Score Aggregation in Specialized Search
نویسندگان
چکیده
In this paper we present an approach to score aggregation for specialized search systems. In our work we focus on document ranking in scientific publication databases. We work with the collection of scientific publications of the CERN Document Server. This paper reports on work in progress and describes rank aggregation framework with score normalization. We present results that we obtained with aggregations based on logistic regression using both ranks and scores. In our experiment we concluded that score-based aggregation favored performance in terms of Average Precision and Mean Reciprocal Rank, while rank-based aggregation favored
منابع مشابه
Enhancing Web Search by Aggregating Results of Related Web Queries
Currently, commercial search engines have implemented methods to suggest alternative Web queries to users, which helps them specify alternative related queries in pursuit of finding neededWeb pages. In this paper, we address the Web search problem on related queries to improve retrieval quality by devising a novel search rank aggregation mechanism. Given an initial query and the suggested relat...
متن کاملScore and Rank Aggregation Methods for Explicit Search Result Diversification
Search result diversification is one of the key techniques to cope with the ambiguous and/or underspecified information needs of the web users. In the last few years, strategies that are based on the explicit knowledge of query aspects emerged as highly effective ways of diversifying the search results. Our contributions in this work are two-fold. First, we extensively evaluate the performance ...
متن کاملFujitsu Laboratories TREC2001 Report
This year a Fujitsu Laboratory team participated in web tracks. Both for ad hoc task, and entry point search task, we combined the score of normal ranking search and that of page ranking techniques. For ad hoc style task, the eect of page ranking was very limitted. We only got very little improvement for title eld search, and the page rank was not eective for description, and narrative eld sear...
متن کاملPartial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of four input rankings to be aggregated into a “median ranking”. We study efficient polynomial-time data reduction rules that allow us to find optimal median rankings. On the theoretical side, we improve a result for a “pa...
متن کاملProbabilistic Score Normalization for Rank Aggregation
Rank aggregation is a pervading operation in IR technology. We hypothesize that the performance of score-based aggregation may be affected by artificial, usually meaningless deviations consistently occurring in the input score distributions, which distort the combined result when the individual biases differ from each other. We propose a score-based rank aggregation model where the source score...
متن کامل